The inverse problem for certain tree parameters
نویسندگان
چکیده
منابع مشابه
The inverse problem for certain tree parameters
Let p be a graph parameter that assigns a positive integer value to every graph. The inverse problem for p asks for a graph within a prescribed class (here, we will only be concerned with trees), given the value of p. In this context, it is of interest to know whether such a graph can be found for all or at least almost all integer values of p. We will provide a very general setting for this ty...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولThe use of inverse quadratic radial basis functions for the solution of an inverse heat problem
In this paper, a numerical procedure for an inverse problem of simultaneously determining an unknown coefficient in a semilinear parabolic equation subject to the specification of the solution at an internal point along with the usual initial boundary conditions is considered. The method consists of expanding the required approximate solution as the elements of the inverse quadrati...
متن کاملA Faster Algorithm for the Inverse Spanning Tree Problem Ravindra
In this paper, we consider the inverse spanning tree problem. Given an undirected graph Go = (Ni, AO) with n nodes, mn arcs, an arc cost vector c, and a spanning tree T, the inverse spanning tree problem is to perturb the arc cost vector c to a vector d so that T is a minimum spanning tree with respect to the cost vector d and the cost of perturbation given by Id c = L(l j) Aldij ciil is minimu...
متن کاملA Faster Algorithm for the Inverse Spanning Tree Problem
In this paper, we consider the inverse spanning tree problem. Given an undi0 Ž 0 0 . rected graph G s N , A with n nodes, m arcs, an arc cost vector c, and a spanning tree T 0, the inverse spanning tree problem is to perturb the arc cost vector c to a vector d so that T 0 is a minimum spanning tree with respect to the < < < < cost vector d and the cost of perturbation given by d y c s Ý d y c i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2009
ISSN: 0166-218X
DOI: 10.1016/j.dam.2009.07.004